|
Variable neighborhood search (VNS), proposed by Mladenović, Hansen, 1997,〔 〕 is a metaheuristic method for solving a set of combinatorial optimization and global optimization problems. It explores distant neighborhoods of the current incumbent solution, and moves from there to a new one if and only if an improvement was made. The local search method is applied repeatedly to get from solutions in the neighborhood to local optima. VNS was designed for approximating solutions of discrete and continuous optimization problems and according to these, it is aimed for solving linear program problems, integer program problems, mixed integer program problems, nonlinear program problems, etc. == Introduction == VNS systematically changes the neighborhood in two phases: firstly, descent to find a local optimum and finally, a perturbation phase to get out of the corresponding valley. Applications are rapidly increasing in number and pertain to many fields: location theory, cluster analysis, scheduling, vehicle routing, network design, lot-sizing, artificial intelligence, engineering, pooling problems, biology, phylogeny, reliability, geometry, telecommunication design, etc. There are several books important for understanding VNS, such as: ''Handbook of Metaheuristics'', 2010, Handbook of Metaheuristics, 2003 and Search methodologies, 2005. Earlier work that motivated this approach can be found in # Davidson, W.C., # Fletcher, R., Powell, M.J.D., # Mladenovi´c, N.〔 〕 and 4. Brimberg, J., Mladenovi´c, N. Recent surveys on VNS methodology as well as numerous applications can be found in 4OR, 2008. and Annals of OR, 2010. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Variable neighborhood search」の詳細全文を読む スポンサード リンク
|